Synthesis of Proof Procedures for Default Reasoning
نویسندگان
چکیده
We apply logic program development technology to deene abstract proof procedures, in the form of logic programs, for computing the admissibility semantics for default reasoning proposed in 2]. The proof procedures are derived from a formal speciication. The derivation guarantees the soundness of the proof procedures. The completeness of the proof procedures is shown by employing a technique of symbolic execution of logic programs to compute (an instance of) a relation implied by the speciication.
منابع مشابه
Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning
We define abstract proof procedures for performing credulous and sceptical non-monotonic reasoning, with respect to the argumentation-theoretic formulation of non-monotonic reasoning proposed in [1]. Appropriate instances of the proposed proof procedures provide concrete proof procedures for concrete formalisms for non-monotonic reasoning, for example logic programming with negation as failure ...
متن کاملArgumentation-theoretic proof procedures for default reasoning
We present a succession of presentations of an argumentation-theoretic proof procedure that applies uniformly to a wide variety of logics for default reasoning, including Theorist, default logic, logic programming, autoepistemic logic, non-monotonic modal logic and certain instances of circumscription. The proof procedure can be viewed as conducting a dispute, which is a sequence of alternating...
متن کاملProlog Technology for Default Reasoning: Proof Theory and Compilation Techniques
The aim of this work is to show how Prolog technology can he used for efficient implementation of query answering in default logics. The idea is to translate a default theory along with a query into a Prolog program and a Prolog query such that the original query is derivable from the default theory iff the Prolog query is derivable from the Prolog program. In order to comply with the goal-orie...
متن کاملProof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bou...
متن کاملAn Extended Framework for Default Reasoning
In this paper, we investigate the proof theory of default reasoning. We generalize Reiter's framework to a monotonic reasoning system, and in particular allow formulae with nested defaults. We give proof rules for this extended default logic, called default ionic logic, and give deduction theorems. We also give examples of applications of our framework to some well-known problems: weak implicat...
متن کامل